Measuring Instability in Normal Residuated Logic Programs: Discarding Information
نویسندگان
چکیده
Inconsistency in the framework of general residuated logic programs can be, somehow, decomposed in two notions: incoherence and instability. In this work, we focus on the measure of instability of normal residuated programs. Some measures are provided and initial results are obtained in terms of the amount of information that have to be discarded in order to recover stability.
منابع مشابه
On the Measure of Instability in Normal Residuated Logic Programs
Inconsistency in the framework of general residuated logic programs can be, somehow, decomposed in two notions: incoherence and instability. In this work, we focus on the measure of instability of normal residuated programs. Some measures were already provided and initial results obtained in terms of the amount of information that have to be discarded in order to recover stability; in this pape...
متن کاملOn the existence of stable models in normal residuated logic programs
We introduce a sufficient condition which guarantees the existence of stable models for a normal residuated logic program interpreted on the truth-space [0, 1]n. Specifically, the continuity of the connectives involved in the program ensures the existence of stable models.
متن کاملA tabulation procedure for first-order residuated logic programs
Residuated logic programs have shown to be a generalisation of a number of approaches to logic programming under uncertainty. Regarding automated deduction, a tabulation procedure was recently introduced for the propositional version. In this paper, we introduce a sound and complete tabulation-based proof procedure for the first-order extension of residuated logic programs.
متن کاملOn the existence and unicity of stable models in normal residuated logic programs
We introduce a sufficient condition which guarantees the existence of stable models for a normal residuated logic program interpreted on the truth-space [0, 1]n. Specifically, the continuity of the connectives involved in the program ensures the existence of stable models. Then, we study conditions which guarantee the uniqueness of stable models in the particular case of the product t-norm, its...
متن کاملA Tabulation Proof Procedure for Residuated Logic Programming
Residuated Logic Programs allow to capture a spate of different semantics dealing with uncertainty and vagueness. In this work we provide a tabulation goal-oriented query procedure, and show that our tabulation query procedure terminates if and only if the sequence of iterations of the immediate consequences operator reaches the least fixpoint after only finitely-many steps. On the basis of thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010